Datalog Programs and Their Stable Models
نویسنده
چکیده
This paper is about the functionality of software systems used in answer set programming (ASP). ASP languages are viewed here, in the spirit of Datalog, as mechanisms for characterizing intensional (output) predicates in terms of extensional (input) predicates. Our approach to the semantics of ASP programs is based on the concept of a stable model defined in terms of a modification of parallel circumscription.
منابع مشابه
Choice Logic Programs and Nash Equilibria in Strategic Games
We define choice logic programs as negation-free datalog programs that allow rules to have exclusive-only disjunctions in the head. We show that choice programs are equivalent to semi-negative datalog programs, at least as far as stable models are concerned. We also discuss an application where strategic games can be naturally formulated as choice programs; it turns out that the stable models o...
متن کاملThe Expressive Powers of Stable Models for Bound and Unbound DATALOG Queries
Various types of stable models are known in the literature: T-stable (total stable), P-stable ( partial stable, also called three-valued stable), M-stable (maximal stable, also known under various different names), and L-stable (least undefined stable). For each type of stable model, the paper analyzes two versions of deterministic semantics: possible semantics, which is based on the union of a...
متن کاملDynamical Properties of Answer Set Programs
Solutions to problems are often not unique. A representation of a problem as a theory in some logical formalism often admits a number of models representing solutions (Marek Truszczyfiski, 1999). The solution-representing models are perhaps required to come from a particular class. The typical strategy is to represent a class of problem instances E, for example the problem of determining a Hami...
متن کاملOn the E ective Semantics of Nondeterministic , Nonmonotonic , Temporal Logic
We consider in this paper an extension of Datalog with mechanisms for temporal, nonmonotonic and nondeterministic reasoning, which we refer to as Datalog++. We study its semantics, and show how iterated xpoint and stable model semantics can be combined to the purpose of clarifying the interpretation of Datalog++ programs, and supporting their eecient execution. On this basis, the design of appr...
متن کاملBack and Forth Semantics for Normal, Disjunctive and Extended Logic programs
We deene a logical semantics called back-and-forth, applicable to normal and disjunctive datalog programs as well as to programs possessing a second, explicit or`strong' negation operator. We show that on normal programs it is equivalent to the well-founded semantics (WFS), and that on disjunctive programs it is equivalent to the P-stable semantics of Eiter, Leone and Saccc a, hence to Przymusi...
متن کامل